Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks
نویسندگان
چکیده
We present a completeness proof of the inductive assertion method for object-oriented programs extended with auxiliary variables. The class of programs considered are assumed to compute over structures which include the standard interpretation of Presburger arithmetic. Further, the assertion language is first-order, i.e., quantification only ranges over basic types like that of the natural numbers, Boolean and Object.
منابع مشابه
Assessment of the completeness of Volunteered Geographic Information focusing on building blocks data (Case Study: Tehran metropolis)
Open Street Map (OSM) is currently the largest collection of volunteered geographic data, widely used in many projects as an alternative to or integrated with authoritative data. However, the quality of these data has been one of the obstacles to the widely use of it. In this article, from among the elements related to the quality of volunteered geographic data, we have tried to examine the com...
متن کاملAn Object-Oriented Dynamic Logic with Updates
With the goal of this thesis being to create a dynamic logic for objectoriented languages, ODL is developed along with a sound and relatively complete calculus. The dynamic logic contains only the absolute logical essentials of object-orientation, yet still allows a “natural” representation of all other features of common object-oriented programming languages. ODL is an extension of a dynamic l...
متن کاملFrege’s Unofficial Arithmetic
Since a statement of number based on counting contains an assertion about a concept, in a logically perfect language a sentence used to make such a statement must contain two parts, first a sign for the concept about which the statement is made, and secondly a sign for a second-order concept. These second-order concepts form a series and there is a rule in accordance with which, if one of these...
متن کاملOn Completeness Results of Hoare Logic Relative to the Standard Model
The general completeness problem of Hoare logic relative to the standard model N of Peano arithmetic has been studied by Cook, and it allows for the use of arbitrary arithmetical formulas as assertions. In practice, the assertions would be simple arithmetical formulas, e.g. of a low level in the arithmetical hierarchy. In addition, we find that, by restricting inputs to N , the complexity of th...
متن کاملOn Attributes of Objects in Object-Oriented Software Analysis
One of the modern paradigms to develop a system is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles. There is a sequence of activities to develop an analysis model. In the first step, we work in developing an initial use case model. Then in the second step, they identify a number of concepts and build a glossary of partic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013